Optimal Design of Hierarchical B-Spline Networks for Nonlinear System Identification

نویسندگان

  • Yuehui Chen
  • Qingjin Meng
  • Yong Zhang
چکیده

Hierarchical B-spline networks consist of multiple B-spline networks assembled in different level or cascade architecture. To identify the hierarchical B-spline networks and select important input features for each sub-B-spline network automatically, a predefined instruction/operator set was used. The structures of hierarchical B-spline networks were created and evolved by using Probabilistic Incremental program Evolution (PIPE), and the parameters were optimized by using Differential Evolution (DE) algorithm. In this framework, the selection method of important input variables for each sub-B-spline network was also accomplished by PIPE. Empirical results on benchmark system identification problems indicate that the proposed method is effective and efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An ${cal O}(h^{8})$ optimal B-spline collocation for solving higher order boundary value problems

As we know the approximation solution of seventh order two points boundary value problems based on B-spline of degree eight has only ${cal O}(h^{2})$ accuracy and this approximation is non-optimal. In this work, we obtain an optimal spline collocation method for solving the general nonlinear seventh order two points boundary value problems. The ${cal O}(h^{8})$ convergence analysis, mainly base...

متن کامل

Solving a nonlinear inverse system of Burgers equations

By applying finite difference formula to time discretization and the cubic B-splines for spatial variable, a numerical method for solving the inverse system of Burgers equations is presented. Also, the convergence analysis and stability for this problem are investigated and the order of convergence is obtained. By using two test problems, the accuracy of presented method is verified. Additional...

متن کامل

Generalized B-spline functions ‎method‎‎ for solving optimal control problems

‎In this paper we introduce a numerical approach that solves optimal control problems (OCPs) ‎using collocation methods‎. ‎This approach is based upon B-spline functions‎. ‎The derivative matrices between any two families of B-spline functions are utilized to‎ ‎reduce the solution of OCPs to the solution of nonlinear optimization problems‎. ‎Numerical experiments confirm our heoretical findings‎.

متن کامل

Learning of B-spline Neural Network Using New Particle Swarm Approaches

New approaches of particle swarm optimisation algorithm based on Gaussian and Cauchy distributions to adjust the control points of B-spline neural networks are proposed. B-spline networks are trained by gradient-based methods, which may fall into local minimum during the learning procedure. To overcome the problems encountered by the conventional learning methods, particle swarm optimisation  ...

متن کامل

Spline Collocation for system of Fredholm and Volterra integro-differential equations

The spline collocation method  is employed to solve a system of linear and nonlinear Fredholm and Volterra integro-differential equations. The solutions are collocated by cubic B-spline and the integrand is approximated by the Newton-Cotes formula. We obtain the unique solution for linear and nonlinear system $(nN+3n)times(nN+3n)$ of integro-differential equations. This approximation reduces th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006